Algorithms and Experimentation System of Unicast, Multicast and Broadcast Transmission for Optical Switches

This paper deals with an optical switching problem concerning an architecture represented by input-output request matrix. New algorithms such as LSA, QLSA, QEXACT and J-family are presented and thoroughly studied. J-family algorithms are some modifications of the well known DOUBLE algorithm. The study focuses on comparison of the proposed algorithms with known algorithms such as DOUBLE and EXACT. The local comparison criteria consist of the number of decomposed matrices, the number of empty slots, the total time of decomposition and excess. As the global index of performance the total speedup is introduced, which comprises local criteria. The properties of the considered algorithms are shown using examples, where matrices with various elements are decomposed on permutation matrices (switch configurations).